Conservative Extensions in the Lightweight Description Logic EL
نویسندگان
چکیده
We bring together two recent trends in description logic (DL): lightweight DLs in which the subsumption problem is tractable and conservative extensions as a central tool for formalizing notions of ontology design such as refinement and modularity. Our aim is to investigate conservative extensions as an automated reasoning problem for the basic tractable DL EL. The main result is that deciding (deductive) conservative extensions is ExpTime-complete, thus more difficult than subsumption in EL, but not more difficult than subsumption in expressive DLs. We also show that if conservative extensions are defined model-theoretically, the associated decision problem for EL is undecidable.
منابع مشابه
Deciding inseparability and conservative extensions in the description logic EL
We study the problem of deciding whether two ontologies are inseparable w.r.t. a signature Σ, i.e., whether they have the same consequences in the signature Σ. A special case is to decide whether an extension of an ontology is conservative. By varying the language in which ontologies are formulated and the query language that is used to describe consequences, we obtain differ-ent versions o...
متن کاملAn Automata-Theoretic Approach to Uniform Interpolation and Approximation in the Description Logic EL
We study (i) uniform interpolation for TBoxes that are formulated in the lightweight description logic EL and (ii) EL-approximations of TBoxes formulated in more expressive languages. In both cases, we give modeltheoretic characterizations based on simulations and cartesian products, and we develop algorithms that decide whether interpolants and approximants exist. We present a uniform approach...
متن کاملAn Automata-Theoretic Approach to Uniform Interpolation and Approximation in the Description Logic
We study (i) uniform interpolation for TBoxes that are formulated in the lightweight description logic EL and (ii) EL-approximations of TBoxes formulated in more expressive languages. In both cases, we give modeltheoretic characterizations based on simulations and cartesian products, and we develop algorithms that decide whether interpolants and approximants exist. We present a uniform approach...
متن کاملjcel: A Modular Rule-based Reasoner
jcel is a reasoner for the description logic EL that uses a rule-based completion algorithm. These algorithms are used to get subsumptions in the lightweight description logic EL and its extensions. One of these extensions is EL, a description logic with restricted expressivity, but used in formal representation of biomedical ontologies. These ontologies can be encoded using the Web Ontology La...
متن کاملLocality and subsumption testing in EL and some of its extensions
In this paper we show that subsumption problems in many lightweight description logics (including EL and EL+) can be expressed as uniform word problems in classes of semilattices with monotone operators. We use possibilities of efficient local reasoning in such classes of algebras, to obtain uniform PTIME decision procedures for CBox subsumption in EL and extensions thereof. These locality cons...
متن کامل